Approximating the large sparse matrix exponential using incomplete orthogonalization and Krylov subspaces of variable dimension
نویسندگان
چکیده
منابع مشابه
Approximating the Matrix Exponential of an Advection-Diffusion Operator Using the Incomplete Orthogonalization Method
In this paper we give first results for the approximation of eb, i.e. the matrix exponential times a vector, using the incomplete orthogonalization method. The benefits compared to the Arnoldi iteration are clear: shorter orthogonalization lengths make the algorithm faster and a large memory saving is also possible. For the case of three term orthogonalization recursions, simple error bounds ar...
متن کاملMatrix exponential and Krylov subspaces for fast time domain computations: recent advances
By using the matrix exponential operator, solution of the system can be written as y(t) = exp(−tA)v. Numerical algorithms, which are based on this approach, are called exponential time integration methods. The essential point is that not the matrix exponential itself but rather its action on the vector v is computed. An attractive feature of the formula y(t) = exp(−tA)v is that it provides solu...
متن کاملRational Krylov Subspaces for Large - Scale
The rational Krylov space is recognized as a powerful tool within Model Order Reduction techniques for linear dynamical systems. However, its success has been hindered by the lack of a parameter-free procedure, which would effectively generate the sequence of shifts used to build the space. In this paper we propose an adaptive computation of these shifts. The whole procedure only requires to in...
متن کاملApproximating Sparse PCA from Incomplete Data
We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimization problem by using the sketch. In particular, we use this approach to obta...
متن کاملA Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks
We consider random-walk transition matrices from large social and information networks. For these matrices, we describe and evaluate a fast method to estimate one column of the matrix exponential. Our method runs in sublinear time on networks where the maximum degree grows doubly logarithmic with respect to the number of nodes. For collaboration networks with over 5 million edges, we find it ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2017
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.2090